Minimum-Loop Realization of Degree Sequences
نویسندگان
چکیده
منابع مشابه
On realization graphs of degree sequences
Given the degree sequence d of a graph, the realization graph of d is the graph having as its vertices the labeled realizations of d, with two vertices adjacent if one realization may be obtained from the other via an edge-switching operation. We describe a connection between Cartesian products in realization graphs and the canonical decomposition of degree sequences described by R.I. Tyshkevic...
متن کاملMinimum degree and density of binary sequences
3 For d, k ∈ N with k ≤ 2d, let g(d, k) denote the infimum density of binary 4 sequences (xi)i∈Z ∈ {0, 1}Z which satisfy the minimum degree condition d ∑ j=1 (xi+j + 5 xi−j) ≥ k for all i ∈ Z with xi = 1. We reduce the problem to determine g(d, k) 6 to a combinatorial problem related to the generalized k-girth of a graph G which 7 is defined as the minimum order of an induced subgraph of G of m...
متن کاملRealization of Degree 10 Minimum Spanning Trees in 3-Space
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
متن کاملOn the Realization of Degree Sequences in Parallel
When is a sequence of integers realizable as the degree sequence of a graph? There are well known necessary and suucient conditions for a sequence of integers to constitute degrees of a graph 1]. There exists a sequential linear time algorithm that construct a graph from a given degree sequence. This algorithm however seems to be inherenty sequencial, and thus hard to parallelize. In this paper...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards
سال: 1982
ISSN: 0160-1741
DOI: 10.6028/jres.087.010